Generalized Spectral Characterization of Graphs Revisited
نویسندگان
چکیده
منابع مشابه
Generalized Spectral Characterization of Graphs Revisited
A graph G is said to be determined by its generalized spectrum (DGS for short) if for any graph H, H and G are cospectral with cospectral complements implies that H is isomorphic to G. Wang and Xu (2006) gave some methods for determining whether a family of graphs are DGS. In this paper, we shall review some of the old results and present some new ones along this line of research. More precisel...
متن کاملSpectral Characterization of Generalized Cocktail-Party Graphs
In the paper, we prove that all generalized cocktail-party graphs with order at least 23 are determined by their adjacency spectra.
متن کاملSpectral Characterization of Some Generalized Odd Graphs
Suppose G is a connected, k-regular graph such that Spec G Spec G where G is a distance-regular graph of diameter d with parameters a1 a2 adÿ1 0 and ad > 0; i.e., a generalized odd graph, we show that G must be distance-regular with the same intersection array as that of G in terms of the notion of Ho ̈man Polynomials. Furthermore, G is isomorphic to G if G is one of the odd polygon ...
متن کاملSpectral characterization of graphs with index
A graph is said to be determined by the adjacency spectrum (DS for short) if there is no other nonisomorphic graph with the same spectrum. All connected graphs with index at most √ 2 + √ 5 are known. In this paper, we show that with few exceptions all of these graphs are DS. AMS Subject Classification: 05C50.
متن کاملSpectral Characterization of Some Cubic Graphs
It is proved that the Cartesian product of an odd cycle with the complete graph on 2 vertices, is determined by the spectrum of the adjacency matrix. We also present some computational results on the spectral characterization of cubic graphs on at most 20 vertices. AMS Subject Classification: 05C50.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2013
ISSN: 1077-8926
DOI: 10.37236/3748